Computing Isometry Groups of Hermitian Maps

A theorem is proved on the structure of the group of isometries of an Hermitian map b : V × V → W , where V and W are vector spaces over a finite field of odd order. Also a Las Vegas polynomial-time algorithm is presented which, given an Hermitian map, finds generators for, and determines the structure of its isometry group. The algorithm can be adapted to construct the intersection of the members in a set of classical subgroups of GL(V ), yielding the first polynomial-time solution of this old problem. The approach develops new algorithmic tools for algebras with involution, which in turn have applications to other computational problems of interest. Implementations of the various algorithms in the Magma system demonstrate their